Efficient multiple-collision trapdoor hash family
نویسندگان
چکیده
In this paper, we suggest a Q2 multiple-collision trapdoor hash family under both integer factoring and discrete logarithm problems, and we present their security proofs. In multiple-collision trapdoor hash family, exposing multiple collisions of similar hash functions will not disclose the private key of trapdoor hash value. In the proposed multiple-collision trapdoor hash family, a pair of secret keys is employed for generating digital signature. Under the suggested trapdoor hash family, we present competitive online and off-line signature schemes that can considerably enhance the efficiency of online and off-line signature schemes. Moreover, in the proposed signature scheme, a trapdoor hash function can be employed for signing multiple documents. When a signer embraces this approach in the public-key digital certificate, there is no need to include an ordinary digital signature scheme to sign the hash function in the off-line part. Copyright # 2011 John Wiley & Sons, Ltd.
منابع مشابه
An Efficient Elliptic Curve Discrete Logarithm based Trapdoor Hash Scheme without Key Exposure
The trapdoor hash function plays essential role in constructing certain secure digital signature, and signature scheme that composed by trapdoor hash function is widely applied in different fields. However, the key exposure problem of trapdoor hash scheme has brought great distress. In this paper, an efficient trapdoor hash scheme without key exposure based on elliptic curve discrete logarithm ...
متن کاملA Secure Chameleon Hash Function without Key Exposure from Pairings
Chameleon signatures are based on well established hash-and-sign paradigm, where a chameleon hash function is used to compute the cryptographic message digest, and becomes an important building block. The chameleon hash function is a trapdoor one-way hash function with some special properties, and plays an important role in constructing chameleon signature. In the paper, we propose a new chamel...
متن کاملEfficient On-line/Off-line Signature Schemes Based on Multiple-Collision Trapdoor Hash Families
1Department of Computer Science and Electrical Engineering, University of Missouri-Kansas City, Kansas City MO 64110, USA 2Department of Information and Computer Science, Park University, Parkville, MO 64152, USA 3State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, Beijing 10049, P.R. China 4Key Laboratory of Network Security and Cryptology, Fujian ...
متن کاملConstant-Round Concurrent Zero Knowledge in the Bounded Player Model
In [18] Goyal et al. introduced the bounded player model for secure computation. In the bounded player model, there are an a priori bounded number of players in the system, however, each player may execute any unbounded (polynomial) number of sessions. They showed that even though the model consists of a relatively mild relaxation of the standard model, it allows for round-efficient concurrent ...
متن کاملA Practical Limit of Security Proof in the Ideal Cipher Model : Possibility of Using the Constant As a Trapdoor In Several Double Block Length Hash Functions
Recently, Shoichi Hirose [2] proposed several double block length (DBL) hash functions. Each DBL hash function uses a constant which has a role to make the DBL hash function collision-resistant in the ideal cipher model. However, we have to instantiate a block cipher. In this paper, we show that the constant may be used as a trapdoor to help a attacker to find a collision easily. In case of 256...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Security and Communication Networks
دوره 5 شماره
صفحات -
تاریخ انتشار 2012